Timed Automata Based Model Checking of Timed Security Protocols
نویسندگان
چکیده
A new approach to verification of timed security protocols is given. The idea consists in modelling a finite number of users (including an intruder) of the computer network and their knowledge about secrets by timed automata. The runs of the product automaton of the above automata correspond to all the behaviours of the protocol for a fixed number of sessions. Verification is performed using the module BMC of the tool VerICS.
منابع مشابه
Verifying Security Protocols with Timestamps via Translation to Timed Automata
In this paper we show a general method of proving authentication and integrity of time dependent security protocols by applying powerful model checking tools originally developed for verifying properties of timed automata. Our approach consists in specifying a security protocol, possibly with timestamps, in a higher-level language and translating automatically the specification to a timed autom...
متن کاملModeling and Checking Timed Authentication of Security Protocols⋆
In this paper we offer a methodology for verifying correctness of (timed) security protocols whose actions are parametrized with time. To this aim the model of a protocol involves delays and timeouts on transitions, and sets time constraints on actions to be executed. Our approach consists in specifying a security protocol, possibly with timestamps, in a higher-level language and translating au...
متن کاملProbabilistic Timed Automata for Security Analysis and Design
The usefulness of formal methods for the description and verification of complex systems is nowadays widely accepted. While some system properties can be studied in a non-timed and nonprobabilistic setting, others, such as quantitative security properties, system performance and reliability properties, require a timed and probabilistic description of the system. This thesis focuses on methods f...
متن کاملVerification of Probabilistic Real-time Systems
Probabilistic model checking is a formal verification technique for systems that exhibit stochastic behaviour. It has been used to analyse a wide range of systems, including communication protocols, such as Bluetooth and FireWire, randomised security protocols, e.g. for anonymity and contract signing, and many others. This paper gives a short introduction to probabilistic model checking, with a...
متن کاملSymbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are an extension of timed automata with discrete probability distributions, and can be used to model timed randomized protocols or fault-tolerant systems. We present symbolic model checking algorithms for probabilistic timed automata to verify qualitative properties, corresponding to satisfaction with probability 0 or 1, as well as quantitative properties, correspon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 93 شماره
صفحات -
تاریخ انتشار 2009